Majority Edge-Colorings of Graphs

نویسندگان

چکیده

We propose the notion of a majority $k$-edge-coloring graph $G$, which is an edge-coloring $G$ with $k$ colors such that, for every vertex $u$ at most half edges incident have same color. show best possible results that minimum degree least $2$ has $4$-edge-coloring, and $4$ $3$-edge-coloring. Furthermore, we discuss natural variation edge-colorings some related open problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

modular edge colorings of mycielskian graphs

let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$‎ ‎($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same‎. ‎the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...

متن کامل

Mi-Edge Colorings of Graphs

An edge coloring of a graph G is called Mi-edge coloring if at most i colors appear at any vertex of G. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G. In this paper we determine the exact value of K2(G) for any graph G of maximum degree at most 3. Mathematics Subject Classification: 05C15, 05C38

متن کامل

Acyclic edge colorings of graphs

A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a′(G), is the least number of colors in an acyclic edge coloring of G. For certain graphs G, a′(G) ≥ ∆(G) + 2 where ∆(G) is the maximum degree in G. It is known that a′(G) ≤ 16∆(G) for any graph G (see [2],[10]). We prove that there exists a const...

متن کامل

Majority Domination Edge Critical Graphs

This paper deals the graphs for which the removal of any edge changes the majority domination number of the graph. γM -critical edges, γM -redundant edges, γM -durable graphs and γM -critical graphs are studied. Further, majority domination critical edges and majority domination critical graphs are characterized.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2023

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/11291